A linear approximation algorithm for bin packing with absolute approximation factor 32
نویسندگان
چکیده
منابع مشابه
An Absolute 2-Approximation Algorithm for Two-Dimensional Bin Packing
We consider the problem of packing rectangles into bins that are unit squares, where the goal is to minimize the number of bins used. All rectangles have to be packed nonoverlapping and orthogonal, i.e., axis-parallel. We present an algorithm for this problem with an absolute worst-case ratio of 2, which is optimal provided P 6= NP.
متن کاملLinear time-approximation algorithms for bin packing
Simchi-Levi (Naval Res. Logist. 41 (1994) 579–585) proved that the famous bin packing algorithms FF and BF have an absolute worst-case ratio of no more than 4 , and FFD and BFD have an absolute worst-case ratio of 3 2 , respectively. These algorithms run in time O(n log n). In this paper, we provide a linear time constant space (number of bins kept during the execution of the algorithm is const...
متن کاملBin Packing Problem: a Linear Constant- Space -approximation Algorithm
Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only has the best possible theoretical factor...
متن کاملApproximation Algorithm for Extensible Bin Packing
3 Creating an FPTAAS 6 3.1 Step1: Rounding . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 3.2 Step 2: Redefining the prolem . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 3.3 Step 3: Weakening . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.4 Step 4a: Solving . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 3.5 Step 4b: ...
متن کاملImproved Approximation Algorithm for Two-Dimensional Bin Packing
We study the two-dimensional bin packing problem with and without rotations. Here we are given a set of two-dimensional rectangular items I and the goal is to pack these into a minimum number of unit square bins. We consider the orthogonal packing case where the edges of the items must be aligned parallel to the edges of the bin. Our main result is a 1.405approximation for two-dimensional bin p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 2003
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(03)00011-x